1905A - Constructive Problems - CodeForces Solution


math

Please click on ads to support us..

C++ Code:

#include<iostream>
using namespace std;
int main ()
{
    ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int a;
cin>>a;

while(a--){
    int n,n1;
cin>>n>>n1;
cout<<max(n,n1)<<'\n';
}
return 0;
}


Comments

Submit
0 Comments
More Questions

Cyclic shifts
Zoos
Build a graph
Almost correct bracket sequence
Count of integers
Differences of the permutations
Doctor's Secret
Back to School
I am Easy
Teddy and Tweety
Partitioning binary strings
Special sets
Smallest chosen word
Going to office
Color the boxes
Missing numbers
Maximum sum
13 Reasons Why
Friend's Relationship
Health of a person
Divisibility
A. Movement
Numbers in a matrix
Sequences
Split houses
Divisible
Three primes
Coprimes
Cost of balloons
One String No Trouble